Diophantine equations with Appell sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine Equations Related with Linear Binary Recurrences

In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...

متن کامل

Appell hypergeometric partial differential equations

Mathematicians often speak of the unity of their subject. Such a unity from the 19th century origins in the history of linear ordinary differential equations, especially those closely connected with elliptic and modular functions. It is concerned with the impact of group theoretical and geometrical ideas upon the problem of understanding the nature of the solutions to a differential equation (s...

متن کامل

Diophantine approximation and Diophantine equations

The first course is devoted to the basic setup of Diophantine approximation: we start with rational approximation to a single real number. Firstly, positive results tell us that a real number x has “good” rational approximation p/q, where “good” is when one compares |x − p/q| and q. We discuss Dirichlet’s result in 1842 (see [6] Course N◦2 §2.1) and the Markoff–Lagrange spectrum ([6] Course N◦1...

متن کامل

Diophantine equations for second order recursive sequences of polynomials

Let B be a nonzero integer. Let define the sequence of polynomials Gn(x) by G0(x) = 0, G1(x) = 1, Gn+1(x) = xGn(x) +BGn−1(x), n ∈ N. We prove that the diophantine equation Gm(x) = Gn(y) for m,n ≥ 3, m 6= n has only finitely many solutions.

متن کامل

Metric discrepancy results for sequences {nkx} and diophantine equations

We establish a law of the iterated logarithm for the discrepancy of sequences (nkx) mod 1 where (nk) is a sequence of integers satisfying a sub-Hadamard growth condition and such that one and four-term Diophantine equations in the variables nk do not have too many solutions. The conditions are discussed, the probabilistic details of the proof are given elsewhere. As a corollary to our results, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Periodica Mathematica Hungarica

سال: 2014

ISSN: 0031-5303,1588-2829

DOI: 10.1007/s10998-014-0047-y